Symbolic Reachability Analysis of Fifo-channel Systems with Nonregular Sets of Conngurations

We address the veriication problem of FIFO-channel systems. We apply the symbolic analysis principle to these systems. We represent their sets of conng-urations using structures called CQDD's combining nite-state automata with linear arithmetical constraints on number of occurrences of symbols. We show that CQDD's allow forward and backward reachability analysis of systems with nonregular sets of conngurations. Moreover, we prove that CQDD's allow to compute the exact eeect of the repeated execution of any xed circuit in the transition graph of a system. We use this fact to deene a generic reachability analysis semi-algorithm parametrized by a set of cycle. Given a set of conng-urations, this semi-algorithm performs a least xpoint calculation to construct the set of its successors (or predecessors). At each step, this calculation is accelerated by considering the circuits in as additional \meta-transitions" in the transition graph, generalizing the approach adopted in BG96].